Analytical Philosophy
Morteza Moniri
Abstract
First, in the light of Feferman’s views, we will examine Gödel’s dichotomy that either the capabilities of the human mind are beyond any finite machine, or there are Diophantine-type mathematical equations that are absolutely unsolvable. Then we examine Putnam’s argument that if ...
Read More
First, in the light of Feferman’s views, we will examine Gödel’s dichotomy that either the capabilities of the human mind are beyond any finite machine, or there are Diophantine-type mathematical equations that are absolutely unsolvable. Then we examine Putnam’s argument that if scientific competence of the mind can be simulated by a Turing machine with the ability to prepare a list of scientific propositions, this machine will not print out the sentence that expresses this ability. In an effort to better understand this proof, we restate it in the language of modal logic. Then, we discuss the possibility of supertask computations to perform infinite basic operations in finite time. This is a possibility that has recently been proposed based on new physical theories. We argue that, assuming that such a possibility is realized, arithmetic will be determinate, meaning that the truth or falsity of each arithmetic sentence will be explainable.
Abolfazl Alam; Morteza Moniri
Abstract
Bounded model theory can be considered as part of first-order model theory, which its aim is to study model-theoretic notions in a language consisting of an order relation where all quantifiers are restricted to the bounded ones. One can apply bounded model theory to study some problems in bounded arithmetic. ...
Read More
Bounded model theory can be considered as part of first-order model theory, which its aim is to study model-theoretic notions in a language consisting of an order relation where all quantifiers are restricted to the bounded ones. One can apply bounded model theory to study some problems in bounded arithmetic. Bounded arithmetic can be considered as a sub-theory of first-order Peano arithmetic in an extended language. Bounded arithmetic has some applications in computational complexity theory. There are already some related bounded model-theoretic concepts like bounded quantifier elimination and bounded model completeness which has been applied to bounded arithmetic and complexity theory. In this article, we review some known results and prove some new ones in bounded model theory and use them to obtain certain results in bounded arithmetic and complexity theory. In particular, we define the notion of bounded model companion and study its relations to some fundamental problems in complexity theory.
Morteza Moniri
Abstract
We first look at some controversial issues in mathematical logic. These issues are often confused by non-specialists. The main topics that we will address in this regard are: Tarski's definition of truth, Tarski's theorem on undefinability of truth, Gödel's completeness theorem and Gödel's ...
Read More
We first look at some controversial issues in mathematical logic. These issues are often confused by non-specialists. The main topics that we will address in this regard are: Tarski's definition of truth, Tarski's theorem on undefinability of truth, Gödel's completeness theorem and Gödel's incompleteness theorems, and first and second-order logic. Next, we will introduce some non-classical logics and their place in philosophical logic as well as logic in computer science. In addition, we discuss some philosophical issues related to logic. Among the issues we discuss are the definition of logic, the difference between logic and logical system, and the challenge of monism versus pluralism in the choice of logic. By separating logic from logical systems, we will defend the view that mathematical logic, as part of mathematics, should only be committed to the standards of mathematics. In this regard, any non-classical logic system that meets these standards will have legitimacy.
